composition field meaning in Chinese
成分域
Examples
- This thesis is divided into two parts . the first one is the research on the feature of composition fields and optimal extension fields as well as the fast algorithm in those fields . the other one is the implementation of those improved algorithms
研究工作分为两个部分,一部分是对复合域、理想扩域的结构特点和其上的快速运算算法的分析、研究；另一部分是对这些快速算法的测试改进，即本地实现。 - So , we put forward an optimized exponential algorithm in which the multiplication with itself was substituted mostly by square . through expanding of composition fields , the time consuming of optimal algorithm is , where n is the number of bits of exponential
通过对算法的分析我们可以得出结论，随着复合域的不断增大，域上指数运算所需的时间可近似表示为，式中n为指数以二进制表示时的比特串长度，为域元素进行多项式相乘所需的时间。 - The main focus concentrates on the two most time consuming arithmetic in finite field calculation , field inversion and field multiplication . by analyzing in detail the performance of algorithms in composition fields , we have drawn a conclusion that the time consuming of square is less than that of multiplication with itself
在对复合域中的算法进行详细分析后发现，多项式平方运算比元素自乘有更好的时间特性，因此尽可能地用平方运算替代自乘运算是在复合域中进行算法优化的主要手段。